Enhanced Dynamic Algorithm of Genome Sequence Alignments
نویسندگان
چکیده
منابع مشابه
Analysis of Chimpanzee History Based on Genome Sequence Alignments
Population geneticists often study small numbers of carefully chosen loci, but it has become possible to obtain orders of magnitude for more data from overlaps of genome sequences. Here, we generate tens of millions of base pairs of multiple sequence alignments from combinations of three western chimpanzees, three central chimpanzees, an eastern chimpanzee, a bonobo, a human, an orangutan, and ...
متن کاملA Linear Programming Based Algorithm for Multiple Sequence Alignments
In this brief paper we discuss an approach to multiple sequence alignment based on treating the alignmenet process as a stochastic control problem. The use of a model based on a Markov decision process leads to a linear programming problem whose solution is linked to a suggested alignment. Our goal is to avoid the expense in time and computation encountered when dynamic programming based algori...
متن کاملBPPS: An Algorithm for Analyzing Protein Sequence Alignments
selection (BPPS), which is based on a two-way mixture model and can simultaneously classify protein sequences into distinct subfamilies and select conserved positions that are characteristic of these subfamilies. When applied to P-loop GTPases, this revealed within Rab, Rho, Ras, and Ran a canonical network of molecular interactions centered on bound nucleotide. This network presumably performs...
متن کاملWhole Genome Alignments Based On Local Alignments
Given the genomes (DNA) of two related species, one of the whole genome alignment tasks is to locate regions on the genomes that possibly contain genes conserved over the two species. Most of the existing whole genome alignment software tools, MUMmer (Delcher et al., 2002; Kurtz et al., 2004), MaxMincluster (Wong et al., 2004), and MSS (Chan et al., 2004), generate Maximal Unique Matches (MUMs)...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information Technology and Computer Science
سال: 2014
ISSN: 2074-9007,2074-9015
DOI: 10.5815/ijitcs.2014.06.06